Evaluating dynamic failure probability for streams with (m, k)-firm deadlines
نویسندگان
چکیده
منابع مشابه
Evaluating Dynamic Failure Probability for Streams with ( m ; k ) - Firm
In 5], we introduced the notion of (m; k)-rm deadlines to better express the timing requirements of real-time streams. For a stream with (m; k)-rm deadlines, the quality of service is acceptable as long as at least m customers meet their deadlines in any window of k consecutive customers. If fewer than m customers meet their deadlines in a window of k consecutive customers, the stream is said t...
متن کاملEvaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines
A real-time stream is said to have (m, k)-firm deadlines if at least m out of any k consecutive customers from the stream must meet their respective deadlines. Such a stream is said to have encountered a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines. Hamdaoui and Ramanathan recently proposed a scheduling policy called Distance Based Priority (DBP) in wh...
متن کاملA Dynamic Priority Assignment Technique for Streams with (m,K)-Firm Deadlines - Computers, IEEE Transactions on
The problem of scheduling multiple streams of realtime customers. is addressed in this paper. The paper first introduces the notion of (m, k)-firm deadlines to better characterize the timing constraints of real-time streams. More specifically, a stream is said to have (m, k)-firm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m, k)-firm dead...
متن کاملHeuristic scheduling for multimedia streams with firm deadlines
Multimediastreams such as audio and video require realtime manipulation. Unlike hard real-time tasks, however, they have firm deadlines since the loss of a few frames does not lead to a significantdegradation in quality. In this paper, we propose a simple but efficient scheduling scheme for multimedia streams using heuristic functions. The proposed heuristic function takes into account the fail...
متن کاملA Service Policy for Real-Time Customers with (m, k, )-Firm Deadlines
The problem of scheduling multiple streams of real-time customers is addressed in this paper. The paper rst introduces the notion of (m; k)-rm deadlines to better characterize the timing constraints of real-time streams. More speciically, a stream is said to have (m; k)-rm deadlines if at least m out of any k consecutive customers must meet their deadlines. Note that, the notion of (m; k)-rm de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1997
ISSN: 0018-9340
DOI: 10.1109/12.641933